On Optimal Replication Group Splits in P2P Data Stores Based on the Hypercube
نویسندگان
چکیده
P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer population dynamics make them suitable for a wide range of application domains. This paper presents and analyzes the split maintenance operation of our P2P data store. The operation aims at reorganizing replication groups in case operation of them becomes sub-optimal. To this end, we present a formal cost model that peers use to compute optimal points when to run performance optimizing maintenance. Finally, we present experimental results that validate our cost model by simulating various
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملPerformance of Lookup Operations in a Hypercube-based P2P Data Store: Theoretical Model and Performance Evaluation
One way for Peer-to-Peer data stores to achieve high data availability is to replicate their data. This is necessary to counter the effects of peer population dynamics also known as churn. A consequence of churn is that locating a data item may require a peer to resend search messages thus introducing additional communication. A formal model of this communication pertaining to data item lookups...
متن کاملA Survey of Dynamic Replication Strategies for Improving Response Time in Data Grid Environment
Large-scale data management is a critical problem in a distributed system such as cloud,P2P system, World Wide Web (WWW), and Data Grid. One of the effective solutions is data replicationtechnique, which efficiently reduces the cost of communication and improves the data reliability andresponse time. Various replication methods can be proposed depending on when, where, and howreplicas are gener...
متن کاملAdaptive File Replication Algorithm for Wireless Mesh Networks
Popular files could exhaust the capacity of the file owner node, leading to low efficiency in P2P file sharing systems. File replication is an effective method to deal with this problem by distributing load over replica nodes. Recently, numerous file replication methods have been proposed for P2P content delivery networks on the Internet. However, due to mobility and resource constraints in the...
متن کاملMultidimensional Data Management in Unstructured P2P Networks
A P2P-based framework is proposed which supports the extraction of aggregates from historical Multidimensional data. This proposed framework provides strong and well-organized query evaluation. When a multidimensional data population is available, data are summarized in a synopsis.The synopsis consists of an index built on top of a set of subsynopses which stores compressed representations of s...
متن کامل